A Public Verifiability Signcryption Scheme without Pairings
نویسندگان
چکیده
منابع مشابه
An Efficient Tripartite Signcryption Scheme Without Bilinear Pairings
Authentication and confidentiality are the most important security goals to be achieved. This paper proposes a new tripartite signcryption scheme without bilinear pairings. The proposed tripartite signcryption scheme is efficient when three entities want to perform secure transactions as in mobile communication or in e-commerce. The proposed scheme is based on the elliptic curve discrete logari...
متن کاملMulti-Proxy Multi-Signcryption Scheme from Pairings
which efficiently combines a multi-proxy multi-signature scheme with a signcryption, is proposed. Its security is analyzed in detail. In our scheme, a proxy signcrypter group could be authorized as a proxy agent by the cooperation of all members in the original signcrypter group. Then the proxy signcryptions can be generated by the cooperation of all the signcrypters in the authorized proxy sig...
متن کاملA Provably Secure Proxy Signcryption Scheme Using Bilinear Pairings
As people in modern societies are busier than any human era and computer network has profound impact on how people work and live through fast and convenient information exchange, people need more help from each other to accomplish more work via network connections in limited period of time. Therefore, privilege delegation mechanism has become a necessary service in modern enterprises and organi...
متن کاملPublic Verifiable Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings
This paper presents public verifiable identity based multi-proxy multisigncryption scheme from pairings. In this scheme a proxy signcrypter group could authorized as a proxy agent by the cooperation of all members in the original signcrypter group. Then the proxy signcryption can be generated by the cooperation of all the signcrypters in the authorized proxy signcrypter group on the behalf of t...
متن کاملAn Identity-Based Signcryption Scheme with Short Ciphertext from Pairings
In this paper, we give a new identity-based signcryption scheme based on pairings. It is secure against adaptive chosen ciphertext and identity attack in the random oracle with the Modified Bilinear Diffie-Hellman assumption [14]. It produces shorter ciphertext than any one of schemes [7],[14] for the same plaintext and adapts to the bandconstrained scenario very well.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2017
ISSN: 0975-8887
DOI: 10.5120/ijca2017912815